Games and Modal Mu-Calculus
نویسنده
چکیده
We deene Ehrenfeucht-Fra ss e games which exactly capture the expressive power of the extremal xed point operators of modal mu-calculus. The resulting games have signiicance, we believe, within and outside of concurrency theory. On the one hand they naturally extend the iterative bisimulation games associated with Hennessy-Milner logic, and on the other hand they ooer deeper insight into the logical role of xed points. For this purpose we also deene second-order propositional modal logic to contrast xed points and second-order quantiiers.
منابع مشابه
Model Checking and Other Games
3 Equivalences, Modal and Temporal Logics 5 3.1 Interactive games and bisimulations . . . . . . . . . . . . . . . 7 3.2 Modal logic and bisimulations . . . . . . . . . . . . . . . . . . . 9 3.3 Temporal properties and modal mu-calculus . . . . . . . . . . 10 3.4 Second-order propositional modal logic . . . . . . . . . . . . . . 15 3.5 Fixed point and second-order games . . . . . . . . . . . . ....
متن کاملBounded game-theoretic semantics for modal mu-calculus
We introduce a new game-theoretic semantics (GTS) for the modal μ-calculus. Our so-called bounded GTS replaces parity games with novel alternative evaluation games where only finite paths arise. Infinite paths are not needed even when the considered transition system is infinite.
متن کاملScalar and Vectorial mu-calculus with Atoms
We study an extension of modal mu-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable. We also show expressive limitations of atom-enriched mu-calculi, and explain how their expressive power depends on the structure of atoms used, a...
متن کاملTree Automata, Mu-calculus and Determinacy
We show that the propositional Mu-Calculus is equivalent in expressive p o wer to nite automata on inn-nite trees. Since complementation is trivial in the Mu-Calculus, our equivalence provides a radically sim-pliied, alternative proof of Rabin's complementation lemma for tree automata, which is the heart of one of the deepest decidability results. We also show h o w Mu-Calculus can be used to e...
متن کاملCompleteness for the modal μ-calculus: separating the combinatorics from the dynamics
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and greatest fixpoint operators. In the seminal paper introducing the formalism in the shape known today, Dexter Kozen also proposed an elegant axiom system, and he proved a partial completeness result with respect to the Kripke-style semantics of the logic. The problem of proving Kozen’s axiom system co...
متن کامل